Wireless Scheduling with Delayed CSI: When Distributed Outperforms Centralized
نویسندگان
چکیده
منابع مشابه
Centralized and Distributed Job Scheduling System Simulation at Exascale
Job scheduling systems aim to efficiently manage the distributed computing power of workstations, servers and supercomputers to maximize throughput. As the development of high-speed networking and powerful supercomputers, the scheduling systems should be up to the exascale that is billions of jobs executed by millions of nodes with thousands of cores each, which is however, beyond the state-of-...
متن کاملMercury: Hybrid Centralized and Distributed Scheduling in Large Shared Clusters
Datacenter-scale computing for analytics workloads is increasingly common. High operational costs force heterogeneous applications to share cluster resources for achieving economy of scale. Scheduling such large and diverse workloads is inherently hard, and existing approaches tackle this in two alternative ways: 1) centralized solutions offer strict, secure enforcement of scheduling invariants...
متن کاملOn distributed scheduling with heterogeneously delayed network-state information
We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs. We characterize the network throughput region for...
متن کاملDistributed caching with centralized control
The beneets of using caches for reducing traac in backbone trunk links and for improving web access times are well-known. However, there are some known problems with traditional web caching, namely, maintaining freshness of web objects, balancing load among a number of caches and providing protection against cache failure. This paper investigates in detail the advantages and disadvantages of a ...
متن کاملWhen a genetic algorithm outperforms hill-climbing
A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2018
ISSN: 1536-1233,1558-0660,2161-9875
DOI: 10.1109/tmc.2018.2809739